A Simple kNN Search Protocol using Data Broadcasting in Wireless Mobile Environments

Data broadcasting is an effective way to disseminate information to a large amount of mobile clients in wireless mobile environments. Many information services can use such a technique to serve the clients, including location-based service. The k nearest neighbor (kNN) search is one of the important locationbased services. With such a search, the clients can get the points of interests around them. In this paper, we propose a kNN search protocol using data broadcasting. We consider how the server generates the broadcast schedule and how the client can efficiently execute the query process in terms of latency (time interval from issuing and terminating a query) and tuning time (time spent on listening to the broadcast). Without using an index in the broadcast, the proposed protocol uses some addition information for each broadcast data instead in order to save the tuning time and latency. The effectiveness of the proposed protocol will be verified by proofs.